Belief Merging by Examples

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Belief Merging by Source Reliability Assessment

Merging beliefs requires the plausibility of the sources of the information to be merged. They are typically assumed equally reliable in lack of hints indicating otherwise [12]; yet, a recent line of research spun from the idea of deriving this information from the revision process itself. In particular, the history of previous revisions [3, 15] and previous merging examples [16] provide inform...

متن کامل

Merging Belief Bases Represented by Logic Programs

This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic merging operators described in the framework of propositional logic. The study of these operators leads to a new definition of the consequence relation between logic programs which is based on the logic of Hereand-There brought by...

متن کامل

Impossibility in Belief Merging

With the aim of studying social properties of belief merging and having a better understanding of impossibility, we extend in three ways the framework of logic-based merging introduced by Konieczny and Pino Pérez. First, at the level of representation of the information, we pass from belief bases to complex epistemic states. Second, the profiles are represented as functions of finite societies ...

متن کامل

Compositional Belief Merging

Belief merging aims at extracting a coherent and informative view from a set of belief bases. A first requirement for belief merging operators is to obey basic rationality conditions. Another expected property is to preserve as much information as possible from the input bases. In this paper, we show how new merging operators, called compositional operators, can be defined from existing ones. S...

متن کامل

Declarative Belief Set Merging Using Merging Plans

We present a declarative framework for belief set merging tasks over (possibly heterogeneous) knowledge bases, where belief sets are sets of literals. The framework is designed generically for flexible deployment to a range of applications, and allows to specify complex merging tasks in tree-structured merging plans, whose leaves are the possible belief sets of the knowledge bases that are proc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Computational Logic

سال: 2016

ISSN: 1529-3785,1557-945X

DOI: 10.1145/2818645